On Semilattice Structure of Mizar Types

نویسنده

  • Grzegorz Bancerek
چکیده

Let us mention that every non empty relational structure which is trivial and reflexive is also complete. Let T be a relational structure. A type of T is an element of T . Let T be a relational structure. We say that T is Noetherian if and only if: (Def. 1) The internal relation of T is reversely well founded. Let us observe that every non empty relational structure which is trivial is also Noetherian. Let T be a non empty relational structure. Let us observe that T is Noetherian if and only if the condition (Def. 2) is satisfied. (Def. 2) Let A be a non empty subset of T . Then there exists an element a of T such that a ∈ A and for every element b of T such that b ∈ A holds a 6< b. Let T be a poset. We say that T is Mizar-widening-like if and only if: (Def. 3) T is a sup-semilattice and Noetherian.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards the Construction of a Model of Mizar Concepts

The aim of this paper is to develop a formal theory of Mizar linguistic concepts following the ideas from [14] and [13]. The theory here presented is an abstract of the existing implementation of the Mizar system and is devoted to the formalization of Mizar expressions. The base idea behind the formalization is dependence on variables which is determined by variable-dependence (variables may de...

متن کامل

Bases of Continuous Lattices 1 Robert Milewski

The article is a Mizar formalization of [13, 168–169]. We show definition and fundamental theorems from theory of basis of continuous lattices. The following proposition is true (1) For every non empty poset L and for every element x of L holds compactbelow(x) = ↓ ↓ x∩the carrier of CompactSublatt(L). Let L be a non empty reflexive transitive relational structure and let X be a subset of Ids(L)...

متن کامل

Mizar's Soft Type System

In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expressions are typed but the values of those expressions are not. In this paper we present the Mizar type system as a collection of type inference rules. We will interpret Mizar types as soft types, by translating Mizar’s type...

متن کامل

Reconstruction of the Mizar Type System in the HOL Light System

The Mizar system is a system for formalization of mathematics. It contains a relatively sophisticated and rich type system, which makes formalization of mathematics in Mizar more intuitive than in other systems. On the other hand, the Mizar type system is very complex and together with obscure implementation of the Mizar verifier there is concern about correctness of the Mizar system. One of th...

متن کامل

Proving the Correctness of Functional Programs using Mizar

A method for proving the correctness of functional programs (e.g., Haskell 98 [1]) using the Mizar system is introduced. The functions in a functional program are translated to Mizar functions and the proofs of existence and uniqueness of Mizar functions are done semi-automatically using schemes in Mizar. Types of variables are also reduced to Mizar types. It is also shown how to design concret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004